Flows on Graphs with Random Capacities

We investigate flows on graphs whose links have random capacities. For binary trees we derive the probability distribution for the maximal flow from the root to a leaf, and show that for infinite trees it vanishes beyond a certain threshold that depends on the distribution of capacities. We then examine the maximal total flux from the root to the leaves. Our methods generalize to simple graphs with loops, e.g., to hierarchical lattices and to complete graphs.Comment: 8 pages, 6 figure

A Geospatial Semantic Enrichment and Query Service for Geotagged Photographs

With the increasing abundance of technologies and smart devices, equipped with a multitude of sensors for sensing the environment around them, information creation and consumption has now become effortless. This, in particular, is the case for photographs with vast amounts being created and shared every day. For example, at the time of this writing, Instagram users upload 70 million photographs a day. Nevertheless, it still remains a challenge to discover the “right” information for the appropriate purpose. This paper describes an approach to create semantic geospatial metadata for photographs, which can facilitate photograph search and discovery. To achieve this we have developed and implemented a semantic geospatial data model by which a photograph can be enrich with geospatial metadata extracted from several geospatial data sources based on the raw low-level geo-metadata from a smartphone photograph. We present the details of our method and implementation for searching and querying the semantic geospatial metadata repository to enable a user or third party system to find the information they are looking for

Statistical Consequences of Devroye Inequality for Processes. Applications to a Class of Non-Uniformly Hyperbolic Dynamical Systems

In this paper, we apply Devroye inequality to study various statistical estimators and fluctuations of observables for processes. Most of these observables are suggested by dynamical systems. These applications concern the co-variance function, the integrated periodogram, the correlation dimension, the kernel density estimator, the speed of convergence of empirical measure, the shadowing property and the almost-sure central limit theorem. We proved in \cite{CCS} that Devroye inequality holds for a class of non-uniformly hyperbolic dynamical systems introduced in \cite{young}. In the second appendix we prove that, if the decay of correlations holds with a common rate for all pairs of functions, then it holds uniformly in the function spaces. In the last appendix we prove that for the subclass of one-dimensional systems studied in \cite{young} the density of the absolutely continuous invariant measure belongs to a Besov space.Comment: 33 pages; companion of the paper math.DS/0412166; corrected version; to appear in Nonlinearit

Evolutionary multi-stage financial scenario tree generation

Multi-stage financial decision optimization under uncertainty depends on a careful numerical approximation of the underlying stochastic process, which describes the future returns of the selected assets or asset categories. Various approaches towards an optimal generation of discrete-time, discrete-state approximations (represented as scenario trees) have been suggested in the literature. In this paper, a new evolutionary algorithm to create scenario trees for multi-stage financial optimization models will be presented. Numerical results and implementation details conclude the paper

Monge Distance between Quantum States

We define a metric in the space of quantum states taking the Monge distance between corresponding Husimi distributions (Q--functions). This quantity fulfills the axioms of a metric and satisfies the following semiclassical property: the distance between two coherent states is equal to the Euclidean distance between corresponding points in the classical phase space. We compute analytically distances between certain states (coherent, squeezed, Fock and thermal) and discuss a scheme for numerical computation of Monge distance for two arbitrary quantum states.Comment: 9 pages in LaTex - RevTex + 2 figures in ps. submitted to Phys. Rev.

The structures of Hausdorff metric in non-Archimedean spaces

For non-Archimedean spaces $X$ and $Y,$ let $\mathcal{M}_{\flat } (X), \mathfrak{M}(V \rightarrow W)$ and $\mathfrak{D}_{\flat }(X, Y)$ be the ballean of $X$ (the family of the balls in $X$), the space of mappings from $X$ to $Y,$ and the space of mappings from the ballen of $X$ to $Y,$ respectively. By studying explicitly the Hausdorff metric structures related to these spaces, we construct several families of new metric structures (e.g., $\widehat{\rho } _{u}, \widehat{\beta }_{X, Y}^{\lambda }, \widehat{\beta }_{X, Y}^{\ast \lambda }$) on the corresponding spaces, and study their convergence, structural relation, law of variation in the variable $\lambda,$ including some normed algebra structure. To some extent, the class $\widehat{\beta }_{X, Y}^{\lambda }$ is a counterpart of the usual Levy-Prohorov metric in the probability measure spaces, but it behaves very differently, and is interesting in itself. Moreover, when $X$ is compact and $Y = K$ is a complete non-Archimedean field, we construct and study a Dudly type metric of the space of $K-$valued measures on $X.$Comment: 43 pages; this is the final version. Thanks to the anonymous referee's helpful comments, the original Theorem 2.10 is removed, Proposition 2.10 is stated now in a stronger form, the abstact is rewritten, the Monna-Springer is used in Section 5, and Theorem 5.2 is written in a more general for

Geometrical Insights for Implicit Generative Modeling

Learning algorithms for implicit generative models can optimize a variety of criteria that measure how the data distribution differs from the implicit model distribution, including the Wasserstein distance, the Energy distance, and the Maximum Mean Discrepancy criterion. A careful look at the geometries induced by these distances on the space of probability measures reveals interesting differences. In particular, we can establish surprising approximate global convergence guarantees for the $1$-Wasserstein distance,even when the parametric generator has a nonconvex parametrization.Comment: this version fixes a typo in a definitio